reflexive closure

См. также в других словарях:

• Reflexive relation — In mathematics, a reflexive relation is a binary relation on a set for which every element is related to itself, i.e., a relation on S where x x holds true for every x in S.[1] For example, could be is equal to . Contents 1 Related terms 2… …   Wikipedia

• Closure (mathematics) — For other uses, see Closure (disambiguation). In mathematics, a set is said to be closed under some operation if performance of that operation on members of the set always produces a unique member of the same set. For example, the real numbers… …   Wikipedia

• Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y)   (cl… …   Wikipedia

• Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… …   Wikipedia

• Preorder — In mathematics, especially in order theory, preorders are binary relations that satisfy certain conditions. For example, all partial orders and equivalence relations are preorders. The name quasiorder is also common for preorders. Other notations …   Wikipedia

• Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… …   Wikipedia

• Strict weak ordering — The 13 possible strict weak orderings on a set of three elements {a, b, c}. The only partially ordered sets are coloured, while totally ordered ones are in black. Two orderings are shown as connected by an edge if they differ by a single… …   Wikipedia

• Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… …   Wikipedia

• Ordered vector space — A point x in R2 and the set of all y such that x≤y (in red). The order here is x≤y if and only if x1 ≤ y1 and x2 ≤ y2. In mathematics an ordered vector space or partially ordered vector space is a vector space equi …   Wikipedia

• рефлексивное замыкание — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN reflexive closure …   Справочник технического переводчика

• Action algebra — In algebraic logic, an action algebra is an algebraic structure which is both a residuated semilattice and a Kleene algebra. It adds the star or reflexive transitive closure operation of the latter to the former, while adding the left and right… …   Wikipedia